The Parity Bit in Quantum Cryptography
نویسندگان
چکیده
An n-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that n-bit string is described by one of two density matrices, ρ (n) 0 and ρ (n) 1 , both in a Hilbert space of dimension 2 n. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string in the case where the single bit states are almost fully overlapping. We believe this result will be useful in proving the ultimate security of quantum crytography in the presence of noise. Typeset using REVTEX 1
منابع مشابه
Generic parity generators design using LTEx methodology: A quantum-dot cellular automata based approach
Quantum-dot Cellular Automata (QCA) is a prominent paradigm that is considered to continue its dominance in thecomputation at deep sub-micron regime in nanotechnology. The QCA realizations of five-input Majority Voter based multilevel parity generator circuits have been introduced in recent years. However, no attention has been paid towards the QCA instantiation of the generic (n-bit) even and ...
متن کاملGeneric parity generators design using LTEx methodology: A quantum-dot cellular automata based approach
Quantum-dot Cellular Automata (QCA) is a prominent paradigm that is considered to continue its dominance in thecomputation at deep sub-micron regime in nanotechnology. The QCA realizations of five-input Majority Voter based multilevel parity generator circuits have been introduced in recent years. However, no attention has been paid towards the QCA instantiation of the generic (n-bit) even and ...
متن کاملDeterministic and Efficient Three-party Quantum Key Distribution
The field of quantum computing is based on the laws of quantum mechanics, including states superposition and entanglement. Quantum cryptography is amongst the most surprising applications of quantum mechanics in quantum information processing. Remote state preparation allows a known state to a sender to be remotely prepared at a receiver’s location when they prior share entanglement and transmi...
متن کاملParity bit in quantum cryptography.
An n-bit string is encoded as a sequence of nonorthogonal quantum states. The parity bit of that n-bit string is described by one of two density matrices, r0 (n) and r1 (n) , both in a Hilbert space of dimension 2. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement ...
متن کاملSecret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices
This paper deals with a secret key agreement problem from correlated random numbers. It is proved that there is a pair of linear matrices that yields a secret key agreement in the situation wherein a sender, a legitimate receiver, and an eavesdropper have access to correlated random numbers. A relation between the coding problem of correlated sources and a secret key agreement problem from corr...
متن کامل